Automated theorem proving

Results: 768



#Item
661Formal methods / Automated theorem proving / Logic in computer science / Type theory / Programming language theory / Matita / Proof assistant / POPLmark challenge / Theorem Proving in Higher-Order Logics / Theoretical computer science / Computer science / Applied mathematics

The Matita Interactive Theorem Prover Andrea Asperti1 , Wilmer Ricciotti1 , Claudio Sacerdoti Coen1 , and Enrico Tassi2 1 Department of Computer Science, University of Bologna

Add to Reading List

Source URL: matita.cs.unibo.it

Language: English - Date: 2012-02-14 06:55:31
662Ubuntu / Logic in computer science / Frama-C / Formal methods / Debian / Proof assistant / Isabelle / Deb / Theorem prover / Software / Dpkg / Automated theorem proving

INFORMATION AND COMMUNICATION TECHNOLOGIES (ICT) PROGRAMME Project FP7-ICT-2009-C[removed]CerCo

Add to Reading List

Source URL: cerco.cs.unibo.it

Language: English - Date: 2013-05-14 11:38:47
663Formal methods / Electronic design automation / Boolean algebra / Electronic design / Electronic engineering / Boolean satisfiability problem / Model checking / Solver / Automated theorem proving / Theoretical computer science / Mathematics / Applied mathematics

Curriculum Vitae Name: Eugene (Evgueni) Goldberg Citizenship:

Add to Reading List

Source URL: eigold.tripod.com

Language: English - Date: 2014-05-13 11:37:03
664Applied mathematics / Mathematical optimization / Reasoning / Problem solving / Automated theorem proving / Hyper-heuristic / Graham Kendall / Memetic algorithm / Reasoning system / Science / Operations research / Artificial intelligence

School of Computer Science and IT Editor: Dr Jon Garibaldi Automated Scheduling, Optimisation and Planning (ASAP) Research Group School of Computer Science and Information Technology The University of Nottingham

Add to Reading List

Source URL: www.asap.cs.nott.ac.uk

Language: English - Date: 2012-03-24 15:11:14
665Logic programming / Unification / Admissible rule / Mathematics / Substitution of variables / Symbol / Mathematical logic / Automated theorem proving / Logic

Higher-Order Constraint Simplification In Dependent Type Theory Jason Reed ∗ Carnegie Mellon University Pittsburgh, USA [removed]

Add to Reading List

Source URL: jcreed.org

Language: English - Date: 2009-10-03 17:03:20
666Logic in computer science / Automated theorem proving / Type theory / Dependently typed programming / Logical framework / Frank Pfenning / Modal logic / Twelf / Theorem Proving in Higher-Order Logics / Theoretical computer science / Mathematical logic / Mathematics

Jason Reed Phone: ([removed]Email: [removed] Web: http://jcreed.org/ Education

Add to Reading List

Source URL: jcreed.org

Language: English - Date: 2013-01-05 19:00:47
667Non-classical logic / Logic in computer science / Type theory / Dependently typed programming / Automated theorem proving / Logical framework / Frank Pfenning / Natural deduction / Intuitionistic logic / Logic / Mathematical logic / Mathematics

Research Statement Jason Reed Research Agenda Motivations Mathematics succeeds when it builds bridges: a result connecting one approach (or one entire field

Add to Reading List

Source URL: jcreed.org

Language: English - Date: 2009-10-03 17:18:21
668Formal methods / Theoretical computer science / Automated theorem proving / Logic in computer science / Proof theory / Mathematical proof / Formal verification / Automated proof checking / Proof assistant / Mathematics / Logic / Applied mathematics

Under consideration for publication in Math. Struct. in Comp. Science Social Processes, Program Verification and All That A N D R E A A S P E R T I,1 H E R M A N G E U V E R S2 and R A J A N A T A R A J A N3 1

Add to Reading List

Source URL: www.cs.unibo.it

Language: English - Date: 2009-09-07 06:47:44
669Automated theorem proving / Resolution / Unit propagation / Clause / Logic programming / IP / Prolog / Modal logic / First-order logic / Logic / Theoretical computer science / Mathematical logic

A Semantic Variant of the Modified Problem Reduction Format • •

Add to Reading List

Source URL: www.cs.unc.edu

Language: English - Date: 2012-03-14 03:24:01
670Automated theorem proving / Logic in computer science / Mathematics / Cyber-physical system / Formal verification / KeY / Carnegie Mellon University / Logic programming / Theoretical computer science / Formal methods / Applied mathematics

Postdoc position: Hybrid Systems Theorem Proving Carnegie Mellon University, Computer Science Department Professor André Platzer is looking for talented researchers with a strong research track record for a project in t

Add to Reading List

Source URL: symbolaris.com

Language: English - Date: 2014-06-14 23:11:52
UPDATE